/*#include<stdio.h>
#include "../include/linkedlist.h"
#include "../include/header.h"
#include "../include/binsrchtree.h"
#include "../include/hashtable.h"
#include "../include/narytree.h"
int main()
{
	printf("created\n");
	return 0;
}*/
/*#include<stdio.h>
#include "../include/binsrchtree.h"
#include "../include/constants.h"
int main(){
	char file_name[CHARSIZE];
	int option,found=0;
	node* tree=NULL;
	do{
	printf("\n1:Insert\t2:Search\t3:Display\t4:Exit\n");
	printf("enter option:\t");
	scanf("%d",&op);
	printf("\n");
	switch(op){
		case 1: printf("Enter path to be inserted\t");
			scanf("%s",file_name);
			printf("\n");
			insert(tree,file_name);
			break;
		case 2: printf("Enter path to be searched\t");
			scanf("%s",file_name);
			printf("\n");
			found=search(tree,file_name);
			if(found==1)
			printf("Path exists\n");
			else printf("Element does't exist\n");
			break;
		case 3: printf("Tree elements\t");
			display(tree);	
			printf("\n");
			break;
		default: break;
	}	
	}while(op<4);
return 0;
}
*/
